Computing ideal sceptical argumentation
نویسندگان
چکیده
منابع مشابه
Inductive Defense for Sceptical Semantics of Extended Argumentation
An abstract argumentation framework may have many extensions. Which extension should be adopted as the semantics depends on the sceptical attitudes of the reasoners. Different degrees of scepticism lead to different semantics ranging from the grounded extension as the most sceptical semantics to preferred extensions as the least sceptical semantics. Extending abstract argumentation to allow att...
متن کاملA dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical “ideal semantics” for argumentation in assumption-based frameworks. This semantics was first proposed for logic programming in [1], extending the well-founded semantics. The proof procedure is defined by means of a form of dispute derivations, obtained by modifying the dispute derivations given in [2] for computing credulous admissible argument...
متن کاملCaSAPI: a system for credulous and sceptical argumentation
We present the CaSAPI system, implementing (a generalisation of) three existing computational mechanisms [8–10] for determining argumentatively whether potential beliefs can be deemed to be acceptable and, if so, for computing supports for them. These mechanisms are defined in terms of dialectical disputes amongst two fictional agents: a proponent agent, eager to determine the acceptability of ...
متن کاملMaximal Ideal Recursive Semantics for Defeasible Argumentation
In [1] a recursive warrant semantics for Defeasible Logic Programming extended with levels of possibilistic uncertainty for defeasible rules was introduced. The resulting argumentation framework, called RP-DeLP, is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties with respect to the strict knowledge. An o...
متن کاملComputing Argumentation with Matrices
Abstract argumentation frameworks with finitely many arguments can be presented in matrix form. For this reason, the strengths and weaknesses of matrix operations are migrated from a mathematical representation to a computer science interpretation. We present matrix operation algorithms that can answer whether a given set of arguments is part of an argumentation extension.argumentation framewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2007
ISSN: 0004-3702
DOI: 10.1016/j.artint.2007.05.003